un 2 00 0 ITERATIVE MAP - MAKING FOR SCANNING EXPERIMENTS

نویسنده

  • B. P. Crill
چکیده

The map-making problem for CMB anisotropy measurements was first considered in the context of the COBE-DMR mission 3,5. It was further extended to quick algorithms for differential measurements 6 taking into account 1/f noise 7. Given the size of the upcoming datasets (≥ 106 pixels for MAP) it is essential that the map-making algorithm remains quick (typically O(nd logLN ) where nd is the number of time-samples, and LN the effective noise-filter length). Another related question, which has been pioneered by1, is how to determine the noise statistical properties from the data itself. We present a map-making method based on Wright’s fast algorithm to compute iteratively a minimum variance map together with an estimate of the detector noise power spectrum which is needed to compute unbiased power spectrum estimators of the cosmological signal.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ar X iv : 0 90 2 . 11 06 v 3 [ m at h . Q A ] 5 J un 2 00 9 ON PROJECTIVE EQUIVALENCE OF UNIVARIATE

We pose and solve the equivalence problem for subspaces of Pn, the (n + 1) dimensional vector space of univariate polynomials of degree ≤ n. The group of interest is SL2 acting by projective transformations on the Grassmannian variety GkPn of k-dimensional subspaces. We establish the equivariance of the Wronski map and use this map to reduce the subspace equivalence problem to the equivalence p...

متن کامل

Iterative map-making methods for Cosmic Microwave Background data analysis

The map-making process of Cosmic Microwave Background data involves linear inversion problems which cannot be performed by a brute force approach for the large timelines of most modern experiments. We present optimal iterative map-making methods, both COBE and Wiener, and apply these methods on simulated data. They produce very well restored maps, by removing nearly completely the correlated no...

متن کامل

ar X iv : 0 80 6 . 12 61 v 1 [ m at h . D G ] 7 J un 2 00 8 Dirac and Nonholonomic Reduction

Several aspects of Dirac reduction are compared and formulated from the same geometric point of view. A link with nonholonomic reduction is found. The theory of optimal momentum maps and reduction is extended from the category of Poisson manifolds to that of closed Dirac manifolds. An optimal reduction method for a class of nonholonomic systems is formulated. Several examples are studied in det...

متن کامل

Iterative Computations with Ordered Read-write Locks Iterative Computations with Ordered Read-write Locks Iterative Computations with Ordered Read-write Locks

We introduce the framework of ordered read-write locks, ORWL, that are characterized by two main features: a strict FIFO policy for access and the attribution of access to lock-handles instead of processes or threads. These two properties allow applications to have a controlled pro-active access to resources and thereby to achieve a high degree of asynchronicity between different tasks of the s...

متن کامل

Realistic wireless network model with explicit capacity evaluation

We consider a realistic model of wireless network where nodes are dispatched in an infinite map with uniform distribution. Signal decays with distance according to attenuation factor α. At any time we assume that the distribution of emitters is λ per square unit area. From the explicit formula of the laplace transform of received signal we derive the explicit formula for the information rate re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000